Finding Generators for Markov Chains via Empirical Transition Matrices

نویسندگان

  • Robert B. Israel
  • Jason Z. Wei
چکیده

In this paper we identify conditions under which a true generator does or does not exist for an empirically observed Markov transition matrix. We show how to search for valid generators and choose the \correct" one that is the most compatible with bond rating behaviors. We also show how to obtain an approximate generator when a true generator does not exist.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding Generators for Markov Chains via Empirical Transition Matrices, with Applications to Credit Ratings

In this paper we identify conditions under which a true generator does or does not exist for an empirically observed Markov transition matrix. We show how to search for valid generators and choose the “correct” one that is the most compatible with bond rating behaviors. We also show how to obtain an approximate generator when a true generator does not exist. We give illustrations using credit r...

متن کامل

Empirical Bayes Estimation in Nonstationary Markov chains

Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical  Bayes estimators  for the transition probability  matrix of a finite nonstationary  Markov chain. The data are assumed to be of  a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...

متن کامل

The Rate of Rényi Entropy for Irreducible Markov Chains

In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.

متن کامل

Relative entropy between Markov transition rate matrices

We derive the relative entropy between two Markov transition rate matrices from sample path considerations. This relative entropy is interpreted as a \level 2.5" large deviations action functional. That is, the level two large deviations action functional for empirical distributions of continuous-time Markov chains can be derived from the relative entropy using the contraction mapping principle...

متن کامل

Cheeger inequalities for transient Markov chains

We construct upper and lower bounds for Cheeger-type constants for transient Markov chains. We first treat the situation where there is a detailed balance condition and obtain bounds that rely exclusively on the first and second eigenvalues of the substochastic transition matrix. Secondly, we consider general substochastic transition matrices and develop bounds in this broader setting. The effi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999